Elementary data structures in ALGOL-like languages
نویسندگان
چکیده
منابع مشابه
Objects and Classes in Algol-Like Languages
Many object-oriented languages used in practice descend from Algol. With this motivation, we study the theoretical issues underlying such languages via the theory of Algollike languages. It is shown that the basic framework of this theory extends cleanly and elegantly to the concepts of objects and classes. An important idea that comes to light is that classes are abstract data types, whose the...
متن کاملSemantics of Dynamic Variables in Algol-like Languages
A denotational semantic model of an Algol-like programming language with local variables, providing fully functional dynamic variable manipulation is presented. Along with the other usual language features, the standard operations with pointers, that is reattachement and dereferencing, and dynamic variables, that is creation and assignment, are explicated using a possible worlds, functor catego...
متن کاملAlgol-like Language
We present a denotational semantics for an Algol-like language Alg, which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. As all the published`test equivalences' 13, 8, 23] for Algol-like languages are contained in the second order subset, they can all be validated (easily) in...
متن کاملVisualization of Distributed Data Structures for HPF-like Languages
This paper motivates the usage of graphics and visualization for efficient utilization of HPF’s data distribution facilities. It proposes a graphical tooltkit consisting of exploratory tools and estimation tools which allow the programmer to navigate through complex distributions and to obtain graphical ratings with respect to load distribution and communication. The toolkit has been implemente...
متن کاملReasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1989
ISSN: 0167-6423
DOI: 10.1016/0167-6423(89)90016-6